Non-trivial wandering domains for heterodimensional cycles
نویسندگان
چکیده
منابع مشابه
Wandering Domains in Non-archimedean Polynomial Dynamics
We extend a recent result on the existence of wandering domains of polynomial functions defined over the p-adic field Cp to any algebraically closed complete non-archimedean field CK with residue characteristic p > 0. We also prove that polynomials with wandering domains form a dense subset of a certain one-dimensional family of degree p + 1 polynomials in CK [z]. Given a rational function φ ∈ ...
متن کاملSynchronization Problems in Automata Without Non-trivial Cycles
In this paper, we study the computational complexity of various problems related to synchronization of weakly acyclic automata, a subclass of widely studied aperiodic automata. We provide upper and lower bounds on the length of a shortest word synchronizing a weakly acyclic automaton or, more generally, a subset of its states, and show that the problem of approximating this length is hard. We a...
متن کاملNongeneric Bifurcations near Heterodimensional Cycles with Inclination Flip in R
Nongeneric bifurcation analysis near rough heterodimensional cycles associated to two saddles in R4 is presented under inclination flip. By setting up local moving frame systems in some tubular neighborhood of unperturbed heterodimensional cycles, we construct a Poincaré return map under the nongeneric conditions and further obtain the bifurcation equations. Coexistence of a heterodimensional c...
متن کاملOn the non-trivial cycles in Collatz’s problem
In this note, we improve upon results of Steiner [9] and Mimuro [8] concerning the structure of non-trivial cycles in Collatz’s problem. AMS 2000 Mathematics Subject Classification. 11B83, 11B75.
متن کاملShortest Non-trivial Cycles in Directed and Undirected Surface Graphs
Let G be a graph embedded on a surface of genus g with b boundary cycles. We describe algorithms to compute multiple types of non-trivial cycles in G, using different techniques depending on whether or not G is an undirected graph. If G is undirected, then we give an algorithm to compute a shortest non-separating cycle in 2O(g)n log log n time. Similar algorithms are given to compute a shortest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinearity
سال: 2017
ISSN: 0951-7715,1361-6544
DOI: 10.1088/1361-6544/aa7cc6